Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions
نویسنده
چکیده
We present simple output-sensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worst-case optimal O (n log h) time and O(n) space, where h denotes the number of vertices of the convex hull.
منابع مشابه
Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima
In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull and the vector maxima problems in three dimensions that are output-size sensitive. Our algorithms achieve Oðlog log n log hÞ parallel time and optimal Oðn log hÞ work with high probability in the CRCW PRAM where n and h are the input and output size, respectively. These bounds are independent of...
متن کاملAdaptive (Analysis of) Algorithms for Convex Hulls and Related Problems
Adaptive analysis is a well known technique in computational geometry, which re nes the traditional worst case analysis over all instances of xed input size by taking into account some other parameters, such as the size of the output in the case of output sensitive analysis. We present two adaptive techniques for the computation of the convex hull in two and three dimensions and related problem...
متن کاملOn a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
In this paper we present a truly practical and provably optimal O(n logh) time output-sensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented in Chan, Snoeyink and Yapp2] where the median-nding step is replaced by an approximate median. We analyze two such schemes and show that for both methods, the algorithm runs in expected O(n log h) ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAdaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearranging) problems of arrays, and define the “presortedness” as a distance from the input array to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 16 شماره
صفحات -
تاریخ انتشار 1996